Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust

نویسندگان

  • Fan Chung Graham
  • Alexander Tsiatas
  • Wensong Xu
چکیده

Motivated by numerous models of representing trust and distrust within a network ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes. We propose and analyze a general ranking metric, called Dirichlet PageRank, which gives a ranking of vertices in a subset S of nodes subject to some specified conditions on the vertex boundary of S. In addition to the usual Dirichlet boundary condition (which disregards the influence of nodes outside of S), we consider general boundary conditions allowing the presence of negative (distrustful) nodes or edges. We give an efficient approximation algorithm for computing Dirichlet PageRank vectors. Furthermore, we give several algorithms for solving various trustbased ranking problems using Dirichlet PageRank with general boundary conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dirichlet PageRank and Trust-Based Ranking Algorithms

Motivated by numerous models of representing trust and distrust within a graph ranking system, we examine a quantitative vertex ranking with consideration of the influence of a subset of nodes. An efficient algorithm is given for computing Dirichlet PageRank vectors subject to Dirichlet boundary conditions on a subset of nodes. We then give several algorithms for various trust-based ranking pro...

متن کامل

Propagating Trust and Distrust to Demote Web Spam

Web spamming describes behavior that attempts to deceive search engine’s ranking algorithms. TrustRank is a recent algorithm that can combat web spam by propagating trust among web pages. However, TrustRank propagates trust among web pages based on the number of outgoing links, which is also how PageRank propagates authority scores among Web pages. This type of propagation may be suited for pro...

متن کامل

Exploiting Trust and Distrust Information to Combat Sybil Attack in Online Social Networks

Due to open and anonymous nature, online social networks are particularly vulnerable to the Sybil attack, in which a malicious user can fabricate many dummy identities to attack the systems. Recently, there is a flurry of interests to leverage social network structure for Sybil defense. However, most of graph-based approaches pay little attention to the distrust information, which is an importa...

متن کامل

A Novel Approach to Propagating Distrust

Trust propagation is a fundamental topic of study in the theory and practice of rankingand recommendation systems on networks. The Page Rank [9] algorithm ranks web pagesby propagating trust throughout a network, and similar algorithms have been designed forrecommendation systems. How might one analogously propagate distrust as well? This is aquestion of practical importance and...

متن کامل

Link-Based Similarity Search to Fight Web Spam

We investigate the usability of similarity search in fighting Web spam based on the assumption that an unknown spam page is more similar to certain known spam pages than to honest pages. In order to be successful, search engine spam never appears in isolation: we observe link farms and alliances for the sole purpose of search engine ranking manipulation. The artificial nature and strong inside ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Internet Mathematics

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2013